BANANAS: A Connectionless Framework for Explicit, Multipath Routing in the Internet∗

نویسندگان

  • H. Tahilramani Kaur
  • S. Kalyanaraman
  • A. Weiss
  • S. Kanwar
  • A. Gandhi
چکیده

This paper presents BANANAS, a connectionless framework for enabling explicit, multipath routing in the Internet. BANANAS uses the idea of a globally known path identifier, known as PathID to achieve source 1 specified, explicit, multipath routing in a partially upgraded network. We show that BANANAS allows introduction of sophisticated explicit and multipath routing capabilities in the context of connectionless routing protocols (e.g. OSPF, IS-IS, BGP etc.). BANANAS provides various alternatives for managing space, speed and computational complexity. The BANANAS framework has been implemented in SSFNet simulator and Linux kernel using Click Router for the forwarding plane and Zebra for the control plane. Results from complexity analysis, SSFNet simulations and Linux/Zebra implementation at Utah’s Emulab testbed have been used to evaluate and illustrate the BANANAS framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BANANAS: A Framework for Explicit, Multipath Routing in the Internet ?

Today the Internet offers a single path between end-systems even though it intrinsically has a large multiplicity of paths. In this paper we present BANANAS, an architectural framework aimed at introducing multipath routing in the Internet. BANANAS uses the idea of a globally known path identifier, known as “PathID” to achieve source 1 specified, explicit, multipath routing in a partially upgra...

متن کامل

Traffic Engineering Techniques and Algorithms for the Internet

Traffic engineering broadly relates to optimization of the operational performance of a network. This survey discusses techniques like multi-path routing, traffic splitting, constraint-based routing, path-protection etc. that are used for traffic engineering in contemporary Internet Service Provider (ISP) networks. These techniques can be classified under two broad classes, connectionless and c...

متن کامل

Adaptive Multipath Routing of Connectionless Traffic in an ATM Network - Communications, 1995. ICC '95 Seattle, 'Gateway to Globalization', 1995 IEEE International Confere

We address the problem of routing connectionless traff i c i n an ATM network and propose an adaptive multipath routing scheme that enhances the routing methods employed at the Inter-Working Units (IWUs). We present a scheme that distributes packets among multiple Virtual Paths (VPs) according t o the utilization of the links of these VPs. The utalzsation o f the V P s as determined b y a feedb...

متن کامل

Congestion-Oriented Shortest Multipath Routing

We present a framework for the modeling of multipath routing in connectionless networks that dynamically adapt to network congestion. The basic routing protocol uses a short-term metric based on hop-by-hop credits to reduce congestion over a given link, and a long-term metric based on end-to-end path delay to reduce delays from a source to a given destination. A worst-case bound on the end-to-e...

متن کامل

Adaptive Multipath Routing of Connectionless Tra c in an ATM Network

We address the problem of routing connectionless traf c in an ATM network and propose an adaptive mul tipath routing scheme that enhances the routing meth ods employed at the Inter Working Units IWUs We present a scheme that distributes packets among mul tiple Virtual Paths VPs according to the utilization of the links of these VPs The utilization of the VPs is determined by a feedback mechanis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005